Discrete time process algebra with silent step
نویسندگان
چکیده
Abstract The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather than weak bisimulation semantics [11, 20]. The version using relative timing is discussed extensively, versions using absolute and parametric timing are presented in brief. A term model and a graph model are presented and soundness and completeness results are given. The time free theories BPAδ and BPAτδ are embedded in the discrete time theories. Examples of the use of the relative time theory are given by means of some calculations on communicating buffers.
منابع مشابه
The Silent S tep in
In untimed process algebras such as CCS and ACP the silent step enables abstraction from internal actions. Several formalizations of abstraction have been introduced, such as observational congruence, delay bisimu-lation and branching bisimulation. However, in real time process algebras, such as ACPp, the silent step has not yet received much attention, so far. Therefore, we formalize these sem...
متن کاملDiscrete Time Process Algebra with Abstraction
ion in absolute timing. where all timing refers to an absolute clock. Here again. we only consider the two-phase version. In section 4. we have discrete time process algebra with parametric timing. where absolute and relative timing are integrated. For parametric timing. we introduce a model based on time spectrum sequences. An underlying viewpoint of the present paper is that for a given time ...
متن کاملA Complete Axiomatization for Pre x Iteration in Branching Bisimulation
This paper studies the interaction of pre x iteration x with the silent step in the setting of branching bisimulation That is we present a nite equational axiomatization for Basic Process Algebra with deadlock empty process and the silent step extended with pre x iteration and prove that this axiomatization is complete with respect to rooted branching bisimulation equivalence
متن کاملA Complete Axiomatization for Prefix Iteration in Branching Bisimulation
This paper studies the interaction of prefix iteration with the silent step in the setting of branching bisimulation. We present a finite equational axiomatization for Basic Process Algebra with deadlock, empty process and the silent step, extended with prefix iteration, and prove that this axiomatization is complete with respect to rooted branching bisimulation equivalence.
متن کاملA General Conservative Extension Theorem in Process Algebra
We proved a general conservative extension theorem for transition system based process theories with easy-to-check and reasonable conditions. The core of this result is another general theorem giving sufficient conditions for a system of operational rules and an extension ensuring that outgoing transitions from an original term in the extension are the same as in the original system. As a simpl...
متن کامل